Scalable subgraph enumeration in MapReduce
نویسندگان
چکیده
منابع مشابه
Scalable Subgraph Enumeration in MapReduce
Subgraph enumeration, which aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph, is a fundamental graph problem with a wide range of applications. However, existing sequential algorithms for subgraph enumeration fall short in handling large graphs due to the involvement of computationally intensive subgraph isomorphism operations. Thus, some recent ...
متن کاملScalable Distributed Subgraph Enumeration
Subgraph enumeration aims to find all the subgraphs of a large data graph that are isomorphic to a given pattern graph. As the subgraph isomorphism operation is computationally intensive, researchers have recently focused on solving this problem in distributed environments, such as MapReduce and Pregel. Among them, the state-of-the-art algorithm, TwinTwigJoin, is proven to be instance optimal b...
متن کاملNetwork Motif Analysis in Clouds - Subgraph Enumeration with Iterative Hadoop MapReduce
Finding network motifs in biological networks is a computationally intensive task as it involves traversing through a large network to enumerate all possible subgraphs of a given size, and then determining their statistical uniqueness by sampling subgraphs from a large number (more than 1,000) of random graph pools. There have been parallelization efforts in the past to mitigate the computation...
متن کاملSubgraph Enumeration in Massive Graphs
We consider the problem of enumerating all instances of a given sample graph in a large data graph. Our focus is on determining the input/output (I/O) complexity of this problem. Let E be the number of edges in the data graph, k = O (1) be the number of vertexes in the sample graph, B be the block length, and M be the main memory size. The main result of the paper is a randomized algorithm that...
متن کاملDensest Subgraph in Streaming and MapReduce
The problem of finding locally dense components of a graph is an important primitive in data analysis, with wide-ranging applications from community mining to spam detection and the discovery of biological network modules. In this paper we present new algorithms for finding the densest subgraph in the streaming model. For any > 0, our algorithms make O(log1+ n) passes over the input and find a ...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
ژورنال
عنوان ژورنال: Proceedings of the VLDB Endowment
سال: 2015
ISSN: 2150-8097
DOI: 10.14778/2794367.2794368